Classification in an informative sample subspace
نویسندگان
چکیده
منابع مشابه
Classification in an informative sample subspace
We have developed an Informative Sample Subspace (ISS) method that is suitable for projecting high dimensional data onto a low dimensional subspace for classification purposes. In this paper, we present an ISS algorithm that uses a maximal mutual information criterion to search a labelled training dataset directly for the subspace’s projection base vectors. We evaluate the usefulness of the ISS...
متن کاملCriteria for informative experiments with subspace identification
Informative experiments are identification experiments which contain sufficient information for an identification algorithm to discriminate between different models in an intended model set. In this paper, a particular set of identification algorithms, namely subspace based identification, is considered. Criteria for experiments to be informative with these methods in the deterministic setup an...
متن کاملInformative Subspace Learning for Counterfactual Inference
Inferring causal relations from observational data is widely used for knowledge discovery in healthcare and economics. To investigate whether a treatment can affect an outcome of interest, we focus on answering counterfactual questions of this type: what would a patient’s blood pressure be had he/she recieved a different treatment? Nearest neighbor matching (NNM) sets the counterfactual outcome...
متن کاملA UNIFIED TERMINOLOGY IN BLOCK DESIGNS An Informative Classification
Partially efficiency balanced (PEB) designs with m efficiency classes have been defined by Puri and Nigam [15] as block designs which have simple analysis and, if properly used, allow the important contrasts to be estimated with desired efficiency. Such designs can be made available in varying replications and/or unequal block sizes. However, any block design is a PEB design with m efficiency c...
متن کاملEstimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the full training set. Results using the parsed Wall Street Journal corpus show that in some circumstances, it is possible to obtain better estimation results using an informative sample than when training upon all the avail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2008
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2007.07.016